Axioms and Divisor Methods for a Generalized Apportionment Problem with Relative Equality

نویسندگان

چکیده

The allocation of seats in a legislative body to groups based on their size is crucial issue legal and political studies. However, recent findings suggest that an optimal may not be proportional the groups. For instance, European Parliament (EP) utilizes subproportional system known as degressive proportionality. Unfortunately, current apportionment methods for EP lack rigorous axiomatic analysis fail adequately address equality. Building upon research equality settings, this paper proposed novel generalization existing axioms divisor proportionality encompass subproportionality with relative Specifically, we consider function f(p)=a+bpγ standard number group p, where a, b γ are given non-negative constants, integer. This theory exemplified through empirical study focused EP.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized divisor problem

In 1952 H.E. Richert by means of the theory of Exponents Pairs (developed by J.G. van der Korput and E. Phillips ) improved the above O-term ( see [8] or [4] pag. 221 ). In 1969 E. Krätzel studied the three-dimensional problem. Besides, M.Vogts (1981) and A. Ivić (1981) got some interesting results which generalize the work of P.G. Schmidt of 1968. In 1987 A.Ivić obtained Ω-results for ∫ T 1 ∆ ...

متن کامل

A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment

Proportional apportionment is the problem of assigning seats to parties according to their relative share of votes. Divisor methods are the de-facto standard solution, used in many countries. In recent literature, there are two algorithms that implement divisor methods: one by Cheng and Eppstein [CE14] has worst-case optimal running time but is complex, while the other [Puk14] is relatively sim...

متن کامل

Evaluation of thresholds for power mean-based and other divisor methods of apportionment

For divisor methods of apportionment with concave up or concave down rounding functions, we prove explicit formulas for the threshold values—the lower and upper bounds for the percentage of population that are necessary and sufficient for a state to receive a particular number of seats. Among the rounding functions with fixed concavity are those based on power means, which include the methods o...

متن کامل

Divisor methods for proportional representation systems: An optimization approach to vector and matrix apportionment problems

When the seats in a parliamentary body are to be allocated proportionally to some given weights, such as vote counts or population data, divisor methods form a prime class to carry out the apportionment. We present a new characterization of divisor methods, via primal and dual optimization problems. The primal goal function is a cumulative product of the discontinuity points of the rounding rul...

متن کامل

Generalized iterative methods for solving double saddle point problem

In this paper, we develop some stationary iterative schemes in block forms for solving double saddle point problem. To this end, we first generalize the Jacobi iterative method and study its convergence under certain condition. Moreover, using a relaxation parameter, the weighted version  of the Jacobi method together with its convergence analysis are considered. Furthermore, we extend a method...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11153270